On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
In computer science, an (a,b) tree is a kind of balanced search tree.
An (a,b)-tree has all of its leaves at the same depth, and all internal nodes except for the root have between a and b children, where a and b are integers such that 2 ≤ a ≤ (b+1)/2. The root has, if it is not a leaf, between 2 and b children.